Adaptive uses of random criterion: The largest number problem, the two-envelope problem, and the anchoring and adjustment heuristic
نویسنده
چکیده
Many cognitive processes appear to incorporate threshold criteria, but when criteria are know to be random their use may appear irrational. For example, when people’s estimates are influenced by random anchors (Tversky & Kahneman, 1974). However Cover (1987) showed that choosing whether a seen or unseen number was greater is improved by using a random number as a criterion. Such Cover functions are also the basis for solving the two-envelope problem. This solution suggests that people’s responses should be influenced by where a value falls in its distribution, a hypothesis supported empirically. The anchoring and adjustment heuristic can also be seen as application of a Cover function. Simulation can demonstrate that adjustment towards a random anchor from an initial random estimate will on average improve the final estimate. Anchoring and adjustment is an example of how Cover functions can contribute to understanding cognitive phenomena, and may have wide applicability.
منابع مشابه
A PFIH-Based Heuristic for Green Routing Problem with Hard Time Windows
Transportation sector generates a considerable part of each nation's gross domestic product and considered among the largest consumers of oil products in the world. This paper proposes a heuristic method for the vehicle routing problem with hard time windows while incorporating the costs of fuel, driver, and vehicle. The proposed heuristic uses a novel speed optimization algorithm to reach its ...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملMaximizing the nurses’ preferences in nurse scheduling problem: mathematical modeling and a meta-heuristic algorithm
The nurse scheduling problem (NSP) has received a great amount of attention in recent years. In the NSP, the goal is to assign shifts to the nurses in order to satisfy the hospital’s demand during the planning horizon by considering different objective functions. In this research, we focus on maximizing the nurses’ preferences for working shifts and weekends off by considering several important...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملConsidering Production Planning in the Multi-period Inventory Routing Problem with Transshipment between Retailers
Generally, the inventory routing problem occurs in a supply chain where customers consider the supplier responsible for inventory replenishment. In this situation, the supplier finds the answer to questions regarding the time and quantity of delivery to the customer as well as the sequence of customers in the routes. Considering the effect of production decisions on answering these questions, t...
متن کامل